A lightweight cell switching and traffic offloading scheme for energy optimization in ultra-dense heterogeneous networks

One of the major capacity boosters for 5G networks is the deployment of ultra-dense heterogeneous networks (UDHNs). However, this deployment results in a tremendous increase in the energy consumption of the network due to the large number of base stations (BSs) involved. In addition to enhanced capacity, 5G networks must also be energy efficient for it to be economically viable and environmentally friendly. Dynamic cell switching is a very common way of reducing the total energy consumption of the network, but most of the proposed methods are computationally demanding, which makes them unsuitable for application in ultra-dense network deployment with massive number of BSs. To tackle this problem, we propose a lightweight cell switching scheme also known as Threshold-based Hybrid cEll swItching Scheme (THESIS) for energy optimization in UDHNs. The developed approach combines the benefits of clustering and exhaustive search (ES) algorithm to produce a solution whose optimality is close to that of the ES (which is guaranteed to be optimal), but is computationally more efficient than ES and as such can be applied for cell switching in real networks even when their dimension is large. The performance evaluation shows that THESIS significantly reduces the energy consumption of the UDHN and can reduce the complexity of finding a near-optimal solution from exponential to polynomial complexity.     

On s-hamiltonian line graphs of claw-free graphs

For an integer $s\ge 0$, a graph $G$ is $s$-hamiltonian if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian, and $G$ is $s$-hamiltonian connected if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of $s$-hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for $s\ge 2$, a line graph $L\left(G\right)$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected. In this paper we prove the following.(i) For an integer $s\ge 2$, the line graph $L\left(G\right)$ of a claw-free graph $G$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected.(ii) The line graph $L\left(G\right)$ of a claw-free graph $G$ is 1-hamiltonian connected if and only if $L\left(G\right)$ is 4-connected.     

Diffusive search with spatially dependent resetting

We consider a stochastic search model with resetting for an unknown stationary target $a\in \mathbb{R}$ with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion constant $D$. The searcher is also armed with an exponential clock with spatially dependent rate $r=r\left(\cdot \right)$, so that if it has failed to locate the target by the time the clock rings, then its position is reset to the origin and it continues its search anew from there. Denote the position of the searcher at time $t$ by $X\left(t\right)$. Let $E_0^{\left(r\right)}$ denote expectations for the process $X\left(\cdot \right)$. The search ends at time $T_a=inf\{t\ge 0:X\left(t\right)=a\}$. The expected time of the search is then ${\int }_{\mathbb{R}}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$. Ideally, one would like to minimize this over all resetting rates $r$. We obtain quantitative growth rates for $E_0^{\left(r\right)}{T}_a$ as a function of $a$ in terms of the asymptotic behavior of the rate function $r$, and also a rather precise dichotomy on the asymptotic behavior of the resetting function $r$ to determine whether $E_0^{\left(r\right)}{T}_a$ is finite or infinite. We show generically that if $r\left(x\right)$ is of the order ${\left|x\right|}^{2l}$, with $l>-1$, then $log{E}_0^{\left(r\right)}{T}_a$ is of the order ${\left|a\right|}^{l+1}$; in particular, the smaller the asymptotic size of $r$, the smaller the asymptotic growth rate of $E_0^{\left(r\right)}{T}_a$. The asymptotic growth rate of $E_0^{\left(r\right)}{T}_a$ continues to decrease when $r\left(x\right)\sim \frac{D\lambda }{x^2}$ with $\lambda >1$; now the growth rate of $E_0^{\left(r\right)}{T}_a$ is more or less of the order ${\left|a\right|}^{\frac{1+\sqrt{1+8\lambda }}{2}}$. Note that this exponent increases to $\infty$ when $\lambda$ increases to $\infty$ and decreases to 2 when $\lambda$ decreases to 1. However, if $\lambda =1$, then $E_0^{\left(r\right)}{T}_a=\infty$, for $a\ne 0$. Our results suggest that for many distributions $\mu$ supported on all of $\mathbb{R}$, a near optimal (or optimal) choice of resetting function $r$ in order to minimize ${\int }_{{\mathbb{R}}^d}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$ will be one which decays quadratically as $\frac{D\lambda }{x^2}$ for some $\lambda >1$. We also give explicit, albeit rather complicated, variational formulas for ${inf}_{r\gneqq 0}{\int }_{{\mathbb{R}}^d}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$. For distributions $\mu$ with compact support, one should set $r=\infty$ off of the support. We also discuss this case.     

A Reactive Molecular Dynamics Study of Chlorinated Organic Compounds. Part II: A ChemTraYzer Study of Chlorinated Dibenzofuran Formation and Decomposition Processes

In our two-paper series, we first present the development of ReaxFF CHOCl parameters using the recently published ParAMS parametrization tool. In this second part, we update the reactive Molecular Dynamics – Quantum Mechanics coupling scheme ChemTraYzer and combine it with our new ReaxFF parameters from Part I to study formation and decomposition processes of chlorinated dibenzofurans. We introduce a self-learning method for recovering failed transition-state searches that improves the overall ChemTraYzer transition-state search success rate by 10 percentage points to a total of 48 %. With ChemTraYzer, we automatically find and quantify more than 500 reactions using transition state theory and DFT. Among the discovered chlorinated dibenzofuran reactions are numerous reactions that are new to the literature. In three case studies, we discuss the set of reactions that are most relevant to the dibenzofuran literature: (i) bimolecular reactions of the chlorinated-dibenzofuran precursors phenoxy radical and 1,3,5-trichlorobenzene, (ii) dibenzofuran chlorination and pyrolysis, and (iii) oxidation of chlorinated dibenzofurans.     

顶空气相色谱-质谱联用结合同位素峰形校正检索技术鉴别芝麻油风味成分

采用顶空气相色谱-质谱联用(GC-MS)仪结合同位素峰形校正检索技术鉴别了市售芝麻油风味成分中的71种化合物,占总检出化合物的90.2%。检出化合物可分为吡嗪、吡咯、吡啶、噻唑、噻吩、吲哚、唑、呋喃、醛类和酚类等,其中醛、酚、吡嗪和呋喃类化合物的含量较高,分别占风味成分含量的37.4%,20.1%,10.0%和6.7%。同位素峰形校正检索技术在低分辨率质谱上可对化合物的相对分子质量实现精确测量,从而为低分辨率四极杆质谱确定化合物的元素组成和解析化合物结构提供了重要依据,同时也为芝麻油的成分分析提供了新的技术手段。